全文获取类型
收费全文 | 65699篇 |
免费 | 8654篇 |
国内免费 | 6103篇 |
专业分类
电工技术 | 5134篇 |
技术理论 | 9篇 |
综合类 | 6996篇 |
化学工业 | 3488篇 |
金属工艺 | 842篇 |
机械仪表 | 3854篇 |
建筑科学 | 2643篇 |
矿业工程 | 1544篇 |
能源动力 | 821篇 |
轻工业 | 3410篇 |
水利工程 | 1385篇 |
石油天然气 | 2949篇 |
武器工业 | 801篇 |
无线电 | 9285篇 |
一般工业技术 | 3447篇 |
冶金工业 | 1326篇 |
原子能技术 | 817篇 |
自动化技术 | 31705篇 |
出版年
2024年 | 166篇 |
2023年 | 951篇 |
2022年 | 1883篇 |
2021年 | 2810篇 |
2020年 | 2511篇 |
2019年 | 1984篇 |
2018年 | 1811篇 |
2017年 | 2179篇 |
2016年 | 2468篇 |
2015年 | 2909篇 |
2014年 | 4497篇 |
2013年 | 4178篇 |
2012年 | 4875篇 |
2011年 | 5245篇 |
2010年 | 4045篇 |
2009年 | 4013篇 |
2008年 | 4496篇 |
2007年 | 5009篇 |
2006年 | 4217篇 |
2005年 | 3808篇 |
2004年 | 3238篇 |
2003年 | 2751篇 |
2002年 | 2075篇 |
2001年 | 1594篇 |
2000年 | 1348篇 |
1999年 | 955篇 |
1998年 | 725篇 |
1997年 | 614篇 |
1996年 | 509篇 |
1995年 | 499篇 |
1994年 | 386篇 |
1993年 | 274篇 |
1992年 | 204篇 |
1991年 | 209篇 |
1990年 | 151篇 |
1989年 | 123篇 |
1988年 | 91篇 |
1987年 | 81篇 |
1986年 | 65篇 |
1985年 | 91篇 |
1984年 | 61篇 |
1983年 | 71篇 |
1982年 | 62篇 |
1981年 | 37篇 |
1980年 | 24篇 |
1979年 | 34篇 |
1978年 | 13篇 |
1977年 | 20篇 |
1976年 | 13篇 |
1964年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
伴随着互联网+的风生水起,信息量暴增的大数据时代应运而来,"网络原住民"大学生不可避免、理所当然地处于大数据洪流之中,但也为其个人隐私保护带来了极大挑战。文章针对大数据带来的安全隐私问题,指出大学生个人隐私泄露的可能原因,提出可以采取的个人隐私保护措施,给出大数据时代隐私保护几种技术,期望能给相关人士提供有效参考。 相似文献
43.
44.
针对BP神经网络模型用于变形监测数据处理时容易陷入局部极小值并且收敛速度慢的问题,提出一种基于模拟退火(Simulated Annealing,SA)算法优化BP神经网络的建筑物变形预测方法,利用SA的全局寻优能力对BP神经网络的模型参数进行优化,使参数迭代过程始终保持较高的“温度”和“能量”,从而确保BP神经网络能够得到全局最优解的同时具备较高的预测精度和收敛速度。采用实际算例对所提SA-BP方法在低信噪比和小样本条件下的预测精度进行验证,结果表明所提方法相对于传统BP神经网络法和小波方法能够获得更高的预测精度,并且在小样本和低信噪比条件下优势更加明显。 相似文献
45.
ABSTRACT Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision-making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually yield nonunique solutions; therefore, an approach blending ordinal and cardinal information is needed. In this work, we consider two cascading problems: first, we compute ordinal preferences, maximizing an index that combines ordinal and cardinal information; then, we obtain a cardinal ranking by enforcing ordinal constraints. Notably, we provide a sufficient condition (that is likely to be satisfied in practical cases) for the first problem to admit a unique solution and we develop a provably polynomial-time algorithm to compute it. The effectiveness of the proposed method is analyzed and compared with respect to other approaches and criteria at the state of the art. 相似文献
46.
In performing pavement life cycle assessment (LCA), users are facing various reports of energy intensity coefficient (EIC) of pavement materials which differ considerably among data sources and therefore alter the LCA results significantly. Instead of selecting a certain EIC without or of little explanation for the current pavement LCA practices, this study proposed a methodology to build probability density function (PDF) for EIC based on available data-set and their qualities. Each data was first evaluated about the data quality indicator (DQI) through data quality pedigree matrix and converted to PDF in modified Beta distribution form. Three weighting methods, the DQI one, coefficient of variation (COV) one and analytical hierarchy process (AHP) one, were developed to assign weightings for different data. Monte Carlo simulation was run with the weighted PDF of each data as input to obtain the ultimate PDF for EIC. A case study to estimate the bitumen’s EIC with eight data samples were performed using the proposed methodology. It is found (1): the estimates by the proposed methodology is of higher reliability (lower COV) compared to any single data due to utilisation of information of the overall data samples; (2) the AHP weighting method is most favoured despite the results of the three weighting methods are close; (3) the central estimates of bitumen’s EIC are between5.4~5.8 MJ/kg. The proposed methodology is helpful in aiding calculating EICs for pavement materials and capturing uncertainties in LCA results in a statistical sense. 相似文献
47.
48.
49.
Learning Association Rules and Tracking the Changing Concepts on Webpages: An Effective Pornographic Websites Filtering Approach 下载免费PDF全文
Jyh-Jian Sheu 《电子科技学刊:英文版》2018,16(1):24-36
We applied the decision tree algorithm to learn association rules between webpage’s category (pornographic or normal) and the critical features. Based on these rules, we proposed an efficient method of filtering pornographic webpages with the following major advantages: 1) a weighted window-based technique was proposed to estimate for the condition of concept drift for the keywords found recently in pornographic webpages; 2) checking only contexts of webpages without scanning pictures; 3) an incremental learning mechanism was designed to incrementally update the pornographic keyword database. 相似文献
50.